Speaker Verification Using Neighborhood Preserving Embedding
نویسندگان
چکیده
In this paper, we adopt a new factor analysis of neighborhood preserving embedding (NPE) for speaker verification under the support vector machine (SVM) framework. NPE aims at preserving the local neighborhood structure on the data and defines a low-dimensional speaker space called neighborhood preserving embedding space. We compare the proposed method with the state-of-the-art total variability approach on the telephone-telephone core condition of the NIST 2008 Speaker Recognition Evaluation (SRE) dataset. The experimental results indicate that the proposed NPE method outperforms the total variability approach, providing up to 24% relative improvement.
منابع مشابه
Using Exciting and Spectral Envelope Information and Matrix Quantization for Improvement of the Speaker Verification Systems
Speaker verification from talking a few words of sentences has many applications. Many methods as DTW, HMM, VQ and MQ can be used for speaker verification. We applied MQ for its precise, reliable and robust performance with computational simplicity. We also used pitch frequency and log gain contour for further improvement of the system performance.
متن کاملUsing Exciting and Spectral Envelope Information and Matrix Quantization for Improvement of the Speaker Verification Systems
Speaker verification from talking a few words of sentences has many applications. Many methods as DTW, HMM, VQ and MQ can be used for speaker verification. We applied MQ for its precise, reliable and robust performance with computational simplicity. We also used pitch frequency and log gain contour for further improvement of the system performance.
متن کاملPrivacy Preserving Speaker Verification Using Adapted GMMs
In this paper we present an adapted UBM-GMM based privacy preserving speaker verification (PPSV) system, where the system is not able to observe the speech data provided by the user and the user does not observe the models trained by the system. These privacy criteria are important in order to prevent an adversary having unauthorized access to the user’s client device from impersonating a user ...
متن کاملOrthogonal Tensor Sparse Neighborhood Preserving Embedding for Two-dimensional Image
Orthogonal Tensor Neighborhood Preserving Embedding (OTNPE) is an efficient dimensionality reduction algorithm for two-dimensional images. However, insufficiencies of the robustness performance and deficiencies of supervised discriminant information are remained. Motivated by the sparse learning, an algorithm called Orthogonal Tensor Sparse Neighborhood Embedding (OTSNPE) for two-dimensional im...
متن کاملFlexible Orthogonal Neighborhood Preserving Embedding
In this paper, we propose a novel linear subspace learning algorithm called Flexible Orthogonal Neighborhood Preserving Embedding (FONPE), which is a linear approximation of Locally Linear Embedding (LLE) algorithm. Our novel objective function integrates two terms related to manifold smoothness and a flexible penalty defined on the projection fitness. Different from Neighborhood Preserving Emb...
متن کامل